Retractions of Finite Distance Functions Onto Tree Metrics
نویسندگان
چکیده
Trees with positively-weighted edges induce a natural metric on any subset of vertices, however not every metric is representable in this way. A problem arising in areas of classification, particularly in evolutionary biology, is how to approximate an arbitrary distance function by such a tree metric, and thereby estimate the underlying tree that generated the data. Such transformations, from distances to tree metrics (and thereby to edge-weighted trees) should have some basic properties such as continuity, but this is lacking in several popular methods, for example (as we show) in "neighbor joining."· However, a continuous transformation, due to Buneman, frequently leads to uninteresting trees. We show how Buneman's construction can be refined so as to lead to more informative trees without sacrificing continuity.
منابع مشابه
Spherical Distance Metrics Applied to Protein Structure Classification
Observed protein structures usually represent energetically favorable conformations. While not all observed structures are necessarily functional, it is generally agreed that protein structure is closely related to protein function. Given a collection of proteins sharing a common global structure, variations in their local structures at specific, critical locations may result in different biolo...
متن کاملMathematics of Domains
Mathematics of Domains A dissertation presented to the Faculty of the Graduate School of Arts and Sciences of Brandeis University, Waltham, Massachusetts by Michael A. Bukatin Two groups of naturally arising questions in the mathematical theory of domains for denotational semantics are addressed. Domains are equipped with Scott topology and represent data types. Scott continuous functions repre...
متن کاملRetractions onto series-parallel posets
The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet admits a retraction onto P, that is, whether there is a homomorphism from Q onto P which fixes every element of P. We study this problem for finite series-parallel posets P. We present equivalent combinatorial, algebraic, and topological charaterisations of posets for which the problem is tractable,...
متن کاملMeasuring the Distance Between Finite Markov Decision Processes
Markov decision processes (MDPs) have been studied for many decades. Recent research in using transfer learning methods to solve MDPs has shown that knowledge learned from one MDP may be used to solve a similar MDP better. In this paper, we propose two metrics for measuring the distance between finite MDPs. Our metrics are based on the Hausdorff metric which measures the distance between two su...
متن کاملOn Continuous Choice of Retractions onto Nonconvex Subsets
For a Banach space B and for a class A of its bounded closed retracts, endowed with the Hausdorff metric, we prove that retractions on elements A ∈ A can be chosen to depend continuously on A, whenever nonconvexity of each A ∈ A is less than 1 2 . The key geometric argument is that the set of all uniform retractions onto an α−paraconvex set (in the spirit of E. Michael) is α 1−α −paraconvex sub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 91 شماره
صفحات -
تاریخ انتشار 1999